Automated Inference with Fuzzy Functional Dependencies over Graded Data
نویسندگان
چکیده
Fuzzy set theory has proved to be a successful paradigm to extend the database relational model, augmenting its skill to capture uncertaintly. This capability may be consider in two levels: the data itself and the constraints defined to adjust the database schema to the real system. When constraints are considered, it is necessary to design methods to reason about it and not only a way to express them. This situation leads to a ambitious goal: the design of automated reasoning methods. Highly-expressive data models are not useful without an automated reasoning method. In this work we introduce an automated method to infer with fuzzy functional dependencies over a high level generalization of the relational model and provide its completeness result.
منابع مشابه
An Efficient Algorithm for Reasoning about Fuzzy Functional Dependencies
A sound and complete Automated Prover for the Fuzzy Simplification Logic (FSL logic) is introduced and based on it a method for efficiently reasoning about fuzzy functional dependencies over domains with similarity relations. The complexity of the algorithm is the same as that of equivalent algorithms for crisp functional dependencies that appear in the literature.
متن کاملFunctional Dependencies of Data Tables Over Domains with Similarity Relations
We study attribute dependencies in a setting of fuzzy logic. Our dependencies are described by formulas A ⇒ B where A and B are fuzzy sets of attributes. The meaning of A ⇒ B is that any two objects that have similar values on attributes from A have also similar values on attributes from B. Our approach generalizes classical functional dependencies from databases and also several approaches to ...
متن کاملBasic Algorithm for Attribute Implications and Functional Dependencies in Graded Setting
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute implications. It can also be used together with graded extension of Ganter’s NextClosure algorithm to compute non-redundant bases of data tables with fuzzy attributes. We present foundations, the algorithm, analysis of ...
متن کاملImprecise Database Inference Using Functional Dependencies
Knowledge discovery in databases can be enhanced by augmenting them with \catalytic relations" conveying external common sense knowledge. Catalytic inference analysis ? the systematic analysis of inference closures in databases augmented with catalytic information ? uncovers new facts and rules, and latent inference channels. This paper presents a formalism for analyzing imprecise inference bas...
متن کاملAttribute Dependencies for Data with Grades
This paper examines attribute dependencies in data that involve grades, such as a grade to which an object is red or a grade to which two objects are similar. We thus extend the classical agenda by allowing graded, or “fuzzy”, attributes instead of Boolean, yes-or-no attributes in case of attribute implications, and allowing approximate match based on degrees of similarity instead of exact matc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013